Vizing's Conjecture for Graphs with Domination Number 3 - a New Proof

نویسنده

  • Bostjan Bresar
چکیده

Vizing’s conjecture from 1968 asserts that the domination number of the Cartesian product of two graphs is at least as large as the product of their domination numbers. In this note we use a new, transparent approach to prove Vizing’s conjecture for graphs with domination number 3; that is, we prove that for any graph G with γ(G) = 3 and an arbitrary graph H, γ(G H) > 3γ(H).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fair reception and Vizing's conjecture

In this paper we introduce the concept of fair reception of a graph which is related to its domination number. We prove that all graphs G with a fair reception of size γ(G) satisfy Vizing’s conjecture on the domination number of Cartesian product graphs, by which we extend the well-known result of Barcalkin and German concerning decomposable graphs. Combining our concept with a result of Aharon...

متن کامل

Vizing's conjecture: a survey and recent results

Vizing’s conjecture from 1968 asserts that the domination number of the Cartesian product of two graphs is at least as large as the product of their domination numbers. In this paper we survey the approaches to this central conjecture from domination theory and give some new results along the way. For instance, several new properties of a minimal counterexample to the conjecture are obtained an...

متن کامل

On Vizing's conjecture

A dominating set D for a graph G is a subset of V (G) such that any vertex in V (G)−D has a neighbor in D, and a domination number γ(G) is the size of a minimum dominating set for G. For the Cartesian product G2H Vizing’s conjecture [10] states that γ(G2H) ≥ γ(G)γ(H) for every pair of graphs G, H. In this paper we introduce a new concept which extends the ordinary domination of graphs, and prov...

متن کامل

Vizing's conjecture and the one-half argument

The domination number of a graph G is the smallest order, γ(G), of a dominating set for G. A conjecture of V. G. Vizing [5] states that for every pair of graphs G and H, γ(G H) ≥ γ(G)γ(H), where G H denotes the Cartesian product of G and H. We show that if the vertex set of G can be partitioned in a certain way then the above inequality holds for every graph H. The class of graphs G which have ...

متن کامل

An improvement on Vizing's conjecture

Let γ(G) denote the domination number of a graph G. A Roman domination function of a graph G is a function f : V → {0, 1, 2} such that every vertex with 0 has a neighbor with 2. The Roman domination number γR(G) is the minimum of f(V (G)) = Σv∈V f(v) over all such functions. Let G H denote the Cartesian product of graphs G and H. We prove that γ(G)γ(H) ≤ γR(G H) for all simple graphs G and H, w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electr. J. Comb.

دوره 22  شماره 

صفحات  -

تاریخ انتشار 2015